منابع مشابه
Unprovable Ramsey-type statements reformulated to talk about primes
Let us say that two finite sets of natural numbers are primality-isomorphic if there is a differencepreserving primality-preserving and nonprimality-preserving bijection between them. Let Φ be the statement “every infinite set B ⊆ N has an infinite subset A such that for any x < y < z in A, the interval { 2 , . . . , 3x+y 2 } is primality-isomorphic to the interval { 2 , . . . , 3x+z 2 }”. We p...
متن کاملRadó Selection Lemma and Other Combinatorial Statements Uniformly Proved
We present an uniform method of proving some combinatorial statements of Radó Selection Lemma type. They mainly come from Cowen [1,2,3].
متن کاملThe Collatz 3n+1 Conjecture Is Unprovable
In this paper, we show that any proof of the Collatz 3n + 1 Conjecture must have an infinite number of lines. Therefore, no formal proof is possible. We also discuss whether the proof strategy in this paper has any promise for proving that the Riemann Hypothesis is also unprovable.
متن کاملUnprovable Security of Two-Message Zero Knowledge
Goldreich and Oren (JoC’94) show that only trivial languages have 2-message zero-knowledge arguments. In this note we consider weaker, super-polynomial-time simulation (SPS), notions of zero-knowledge. We present barriers to using black-box reductions for demonstrating soundness of 2-message protocols with efficient prover strategies satisfying SPS zero-knowledge. More precisely, we show that a...
متن کاملNon-Obfuscated Unprovable Programs & Many Resultant Subtleties
The International Obfuscated C Code Contest was a programming contest for the most creatively obfuscated yet succinct C code. By contrast, an interest herein is in programs which are, in a sense, easily seen to be correct, but which cannot be proved correct in pre-assigned, computably axiomatized, powerful, true theories T. A point made by our first theorem, then, is that, then, unverifiable pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1992
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90686-a